Scalable Multisensor Multitarget Tracking Using the Marginalized <inline-formula> <tex-math notation="LaTeX">$\delta$</tex-math> </inline-formula>-GLMB Density

Minimum Vertex Degree Threshold for <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"></math>tiling

We prove that the vertex degree threshold for tiling C3 4 (the 3-uniform hypergraph with four vertices and two triples) in a 3-uniform hypergraph on n ∈ 4N vertices is (n−1 2 ) − ( 4 n 2 ) + 8n + c, where c = 1 if n ∈ 8N and c = −2 otherwise. This result is best possible, and is one of the first results on vertex degree conditions for hypergraph tiling. C © 2014 Wiley Periodicals, Inc. J. Graph...

Math 254a: the Analytic Class Number Formula, and Dirichlet Characters

Math 254a: the Analytic Class Number Formula I

Temporal Decomposition for Online Multisensor-Multitarget Tracking

In this work we develop a novel temporal decomposition scheme for solving data association in multisensormultitarget tracking problems. Given a set of noisy measurements from any number of sensors the data association problem is to determine which measurements originate from which targets. The problem is traditionally posed as an N -dimensional assignment problem, which is NP-hard for N ≥ 3 dim...

Multisensor Multitarget Mixture Reduction Algorithms for Tracking

A single-sensor single-target Mixture Reduction (MR) data association algorithm is extended for use in multisensor multitarget tracking situations. MR is extended for tracking an arbitrary number of targets using an arbitrary number of sensors under the assumption that the sensor measurement errors are independent across sensors. Like the single-sensor single-target MR algorithm, which gives be...